Independent transversals in locally sparse graphs
نویسندگان
چکیده
منابع مشابه
Independent transversals in locally sparse graphs
Let G be a graph with maximum degree ∆ whose vertex set is partitioned into parts V (G) = V1∪ . . .∪Vr . A transversal is a subset of V (G) containing exactly one vertex from each part Vi. If it is also an independent set, then we call it an independent transversal. The local degree of G is the maximum number of neighbors of a vertex v in a part Vi, taken over all choices of Vi and v 6∈ Vi. We ...
متن کاملIndependent Transversals and Independent Coverings in Sparse Partite Graphs
An [n, k, r]-partite graph is a graph whose vertex set, V , can be partitioned into n pairwisedisjoint independent sets, V1, . . . , Vn, each containing exactly k vertices, and the subgraph induced by Vi ∪ Vj contains exactly r independent edges, for 1 ≤ i < j ≤ n. An independent transversal in an [n, k, r]-partite graph is an independent set, T , consisting of n vertices, one from each Vi. An ...
متن کاملIndependent transversals in r-partite graphs
Let G(r, n) denote the set of all r-partite graphs consisting of n vertices in each partite class. An independent transversal of G ∈ G(r, n) is an independent set consisting of exactly one vertex from each vertex class. Let ∆(r, n) be the maximal integer such that every G ∈ G(r, n) with maximal degree less than ∆(r, n) contains an independent transversal. Let Cr = limn→∞ ∆(r,n) n . We establish...
متن کاملOdd Cycle Transversals and Independent Sets in Fullerene Graphs
A fullerene graph is a cubic bridgeless plane graph with all faces of size 5 and 6. We show that every fullerene graph on n vertices can be made bipartite by deleting at most √ 12n/5 edges, and has an independent set with at least n/2 − √ 3n/5 vertices. Both bounds are sharp, and we characterise the extremal graphs. This proves conjectures of Došlić and Vukičević, and of Daugherty. We deduce tw...
متن کاملIndependent transversals of longest paths in locally semicomplete and locally transitive digraphs
We present several results concerning the Laborde-Payan-Xuang conjecture stating that in every digraph there exists an independent set of vertices intersecting every longest path. The digraphs we consider are defined in terms of local semicompleteness and local transitivity. We also look at oriented graphs for which the length of a longest path does not exceed 4.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2007
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2007.02.003